منابع مشابه
PageRank Optimization by Edge Selection
The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts – including web-page ranking – and can be interpreted as the average portion of time spent at the node by an infinite random walk in the graph. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of ed...
متن کاملUsing PageRank in Feature Selection
Feature selection is an important task in data mining because it allows to reduce the data dimensionality and eliminates the noisy variables. Traditionally, feature selection has been applied in supervised scenarios rather than in unsupervised ones. Nowadays, the amount of unsupervised data available on the web is huge, thus motivating an increasing interest in feature selection for unsupervise...
متن کاملPageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts – including ranking websites – and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are ...
متن کاملportfolio selection by robust optimization
this paper discusses the portfolio selection based on robust optimization. since the parameters values of the portfolio optimization problem such as price of the stock, dividends, returns, etc. of per share are unknown, variable and their distributions are uncertain because of the market and price volatility, therefore, there is a need for the development and application of methodologies for de...
متن کاملNorm selection and optimization for new range-based edge detector
We have recently described a range-based neighbourhood operator and an experimentally discovered edge detector based on it. The latter relies on data fitting in a pixel neighbourhood, and has a wide dynamic range. A preliminary theoretical investigation of its basis, and some of its properties, have only been recently presented. In this paper, we introduce some new insights which have led to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.01.007